package mao.exaimnation.netease1;

import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

/**
 * @author Totoro
 * @date 2020/9/12
 * @explain:
 */
public class Main2 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()){
            String next = scanner.next();
            int len = next.length();
            Map<Integer,Integer> map = new HashMap<>();
            int result = 0;
            int helper = 0;
            for (int i = 0; i < len ; i++) {
                char c = next.charAt(i);
                if (c == 'a' || c == 'e' || c == 'o' || c == 'i' || c == 'u'){
                    helper = helper ^ (1 << (c - 'a'));
                }
                if (0 == helper){
                    result = Math.max(result,i+1);
                }else if (map.containsKey(helper)){
                    result = Math.max(result,i-map.get(helper));
                }else {

                        map.put(helper,i);

                }
            }
            System.out.println(result);
        }
    }

}
